Maximum cliques in graphs with small intersection number and random intersection graphs
نویسندگان
چکیده
منابع مشابه
Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs
In this paper, we relate the problem of finding a maximum clique to the intersection number of the input graph (i.e. the minimum number of cliques needed to edge cover the graph). In particular, we consider the maximum clique problem for graphs with small intersection number and random intersection graphs (a model in which each one of m labels is chosen independently with probability p by each ...
متن کاملLarge Cliques in Sparse Random Intersection Graphs
Given positive integers n and m, and a probability measure P on {0, 1, . . . ,m}, the random intersection graph G(n,m,P ) on vertex set V = {1, 2, . . . , n} and with attribute set W = {w1, w2, . . . , wm} is defined as follows. Let S1, S2, . . . , Sn be independent random subsets of W such that for any v ∈ V and any S ⊆ W we have P(Sv = S) = P (|S|)/ ( m |S| ) . The edge set of G(n,m,P ) consi...
متن کاملRandom Subcube Intersection Graphs I: Cliques and Covering
We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube Qd to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their intersection is non-empty. Our motivation for considering such graphs is to model ‘random compatibility’ between vertices in a large network. For both of the model...
متن کاملIntersection graphs associated with semigroup acts
The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science Review
سال: 2021
ISSN: 1574-0137
DOI: 10.1016/j.cosrev.2020.100353